Heuristic Search for Cluster Centroids: An Ant-Based Approach for FCM Initialization
Identifieur interne : 001178 ( Main/Exploration ); précédent : 001177; suivant : 001179Heuristic Search for Cluster Centroids: An Ant-Based Approach for FCM Initialization
Auteurs : Zhiding Yu [Hong Kong] ; Ruobing Zou [République populaire de Chine] ; Simin Yu [République populaire de Chine]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: An ant-based approach to heuristic centroid searching is introduced. The proposed algorithm consists of three major stages: path construction, evaluation and pheromone updating. In the first stage, data pieces are deemed ants which probabilistically choose cluster centroids according to the heuristic and pheromone information of clusters. In the second stage, cluster centers are updated and cluster validity is evaluated using Bezdek’s partition coefficient. In the third stage, pheromone concentration on clusters is updated. When an ant goes to a cluster, it leaves on this centroid pheromone information, the amount of which is determined by evaluation result obtained in the second stage. Initial cluster number is intentionally chosen to be large and cluster merging is performed once the following two conditions are satisfied: 1. Size of the smallest cluster is smaller than a threshold size proportional to the average cluster size; 2. Distance between the smallest cluster and its nearest one is less than a threshold distance. This merging mechanism is shown to enable auto determination of cluster number. The above stages are iteratively performed for a certain number of iterations. The found centroids are used to initialize FCM clustering algorithm. Results on test data sets show that the partitions found using the ant initialization are better optimized than those obtained from random initializations.
Url:
DOI: 10.1007/978-3-642-01510-6_91
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001729
- to stream Istex, to step Curation: 001729
- to stream Istex, to step Checkpoint: 000363
- to stream Main, to step Merge: 001190
- to stream Main, to step Curation: 001178
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Heuristic Search for Cluster Centroids: An Ant-Based Approach for FCM Initialization</title><author><name sortKey="Yu, Zhiding" sort="Yu, Zhiding" uniqKey="Yu Z" first="Zhiding" last="Yu">Zhiding Yu</name></author><author><name sortKey="Zou, Ruobing" sort="Zou, Ruobing" uniqKey="Zou R" first="Ruobing" last="Zou">Ruobing Zou</name></author><author><name sortKey="Yu, Simin" sort="Yu, Simin" uniqKey="Yu S" first="Simin" last="Yu">Simin Yu</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F8EE1796927B3CCDAA9339D1FE14A936E9CDC1EF</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-01510-6_91</idno><idno type="url">https://api.istex.fr/document/F8EE1796927B3CCDAA9339D1FE14A936E9CDC1EF/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001729</idno><idno type="wicri:Area/Istex/Curation">001729</idno><idno type="wicri:Area/Istex/Checkpoint">000363</idno><idno type="wicri:doubleKey">0302-9743:2009:Yu Z:heuristic:search:for</idno><idno type="wicri:Area/Main/Merge">001190</idno><idno type="wicri:Area/Main/Curation">001178</idno><idno type="wicri:Area/Main/Exploration">001178</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Heuristic Search for Cluster Centroids: An Ant-Based Approach for FCM Initialization</title><author><name sortKey="Yu, Zhiding" sort="Yu, Zhiding" uniqKey="Yu Z" first="Zhiding" last="Yu">Zhiding Yu</name><affiliation wicri:level="1"><country xml:lang="fr">Hong Kong</country><wicri:regionArea>Department of Electronic & Computer Engineering, the Hong Kong University of Science & Technology, Clear Water Bay, Kowloon</wicri:regionArea><wicri:noRegion>Kowloon</wicri:noRegion></affiliation><affiliation><wicri:noCountry code="no comma">E-mail: hsfzchrisding@hotmail.com</wicri:noCountry></affiliation></author><author><name sortKey="Zou, Ruobing" sort="Zou, Ruobing" uniqKey="Zou R" first="Ruobing" last="Zou">Ruobing Zou</name><affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country><wicri:regionArea>School of Electronic and Information Engineering, South China University of Technology, 510641, Guangzhou</wicri:regionArea><placeName><settlement type="city">Jiangmen</settlement><region type="province">Guangdong</region></placeName></affiliation></author><author><name sortKey="Yu, Simin" sort="Yu, Simin" uniqKey="Yu S" first="Simin" last="Yu">Simin Yu</name><affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country><wicri:regionArea>School of Automation, Guangdong University of Technology, 510006, Guangzhou</wicri:regionArea><placeName><settlement type="city">Jiangmen</settlement><region type="province">Guangdong</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">F8EE1796927B3CCDAA9339D1FE14A936E9CDC1EF</idno><idno type="DOI">10.1007/978-3-642-01510-6_91</idno><idno type="ChapterID">Chap91</idno><idno type="ChapterID">91</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: An ant-based approach to heuristic centroid searching is introduced. The proposed algorithm consists of three major stages: path construction, evaluation and pheromone updating. In the first stage, data pieces are deemed ants which probabilistically choose cluster centroids according to the heuristic and pheromone information of clusters. In the second stage, cluster centers are updated and cluster validity is evaluated using Bezdek’s partition coefficient. In the third stage, pheromone concentration on clusters is updated. When an ant goes to a cluster, it leaves on this centroid pheromone information, the amount of which is determined by evaluation result obtained in the second stage. Initial cluster number is intentionally chosen to be large and cluster merging is performed once the following two conditions are satisfied: 1. Size of the smallest cluster is smaller than a threshold size proportional to the average cluster size; 2. Distance between the smallest cluster and its nearest one is less than a threshold distance. This merging mechanism is shown to enable auto determination of cluster number. The above stages are iteratively performed for a certain number of iterations. The found centroids are used to initialize FCM clustering algorithm. Results on test data sets show that the partitions found using the ant initialization are better optimized than those obtained from random initializations.</div></front></TEI><affiliations><list><country><li>Hong Kong</li><li>République populaire de Chine</li></country><region><li>Guangdong</li></region><settlement><li>Jiangmen</li></settlement></list><tree><country name="Hong Kong"><noRegion><name sortKey="Yu, Zhiding" sort="Yu, Zhiding" uniqKey="Yu Z" first="Zhiding" last="Yu">Zhiding Yu</name></noRegion></country><country name="République populaire de Chine"><region name="Guangdong"><name sortKey="Zou, Ruobing" sort="Zou, Ruobing" uniqKey="Zou R" first="Ruobing" last="Zou">Ruobing Zou</name></region><name sortKey="Yu, Simin" sort="Yu, Simin" uniqKey="Yu S" first="Simin" last="Yu">Simin Yu</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001178 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001178 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= OperaV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F8EE1796927B3CCDAA9339D1FE14A936E9CDC1EF
|texte= Heuristic Search for Cluster Centroids: An Ant-Based Approach for FCM Initialization
}}
| This area was generated with Dilib version V0.6.21. |  |